Maximally fast coarsening algorithms
نویسندگان
چکیده
منابع مشابه
Maximally fast coarsening algorithms.
We present maximally fast numerical algorithms for conserved coarsening systems that are stable and accurate with a growing natural time step Deltat=At2/3s. We compare the scaling structure obtained from our maximally fast conserved systems directly against the standard fixed time-step Euler algorithm, and find that the error scales as square root of A--so arbitrary accuracy can be achieved. Fo...
متن کاملSampling and multilevel coarsening algorithms for fast matrix approximations
This paper addresses matrix approximation problems for matrices that are large, sparse and/or that are representations of large graphs. To tackle these problems, we consider algorithms that are based primarily on coarsening techniques, possibly combined with random sampling. A multilevel coarsening technique is proposed which utilizes a hypergraph associated with the data matrix and a graph coa...
متن کاملFast Synthesis of Planar, Maximally Thinned Arrays
In this paper a method for a fast synthesis of planar, maximally thinned and steerable arrays is proposed and tested on several benchmarks available in literature. The method optimizes simultaneously the weight coefficients and sensor positions of a planar array without using global optimization schemes, properly exploiting convex optimization based algorithms. The resulting arrays are able to ...
متن کاملError analysis in unconditionally stable coarsening algorithms
In order to quantitatively study the accuracy of the unconditionally stable coarsening algorithms, we calculate the Fourier space multi step error on the order parameter field by explicitly distinguishing the analytic time τ and the algorithmic time t. The calculation determines the error in the order parameter and the scaled correlations. This error contributes a correction term in the analyti...
متن کاملMaximally and non-maximally fast escaping points of transcendental entire functions
We partition the fast escaping set of a transcendental entire function into two subsets, the maximally fast escaping set and the non-maximally fast escaping set. These sets are shown to have strong dynamical properties. We show that the intersection of the Julia set with the non-maximally fast escaping set is never empty. The proof uses a new covering result for annuli, which is of wider intere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2005
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.72.055701